Equational Axiomatization of Bicoercibility for Polymorphic Types
نویسنده
چکیده
Two polymorphic types and are said to be bicoercible if there is a coercion from to and conversely. We give a complete equational axiomatization of bicoercible types and prove that the relation of bicoercibility is decidable.
منابع مشابه
Equational Axiomization of Bicoercibility for Polymorphic Types
Two polymorphic types and are said to be bicoercible if there is a coercion from to and conversely. We give a complete equational axiomatization of bicoercible types and prove that the relation of bicoercibility is decidable.
متن کاملUsing Synthetic Domain Theory to Prove Operational Properties of a Polymorphic Programming Language Based on Strictness∗
We present a simple and workable axiomatization of domain theory within intuitionistic set theory, in which predomains are (special) sets, and domains are algebras for a simple equational theory. We use the axioms to construct a relationally parametric set-theoretic model for a compact but powerful polymorphic programming language, given by a novel extension of intuitionistic linear type theory...
متن کاملFully Complete Models for ML Polymorphic Types
We present an axiomatic characterization of models fully-complete for ML-polymorphic types of system F. This axiomatization is given for hyperdoctrine models, which arise as adjoint models, i.e. co-Kleisli categories of suitable linear categories. Examples of adjoint models can be obtained from categories of Partial Equivalence Relations over Linear Combinatory Algebras. We show that a special ...
متن کاملEquational Axioms for Probabilistic Bisimilarity
This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finite-state agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571–595). The axiomatization is obtained by extending the general axioms of iteration theories (or iteration algebras), which characterize the equational p...
متن کاملOn the Dynamic Logic of Agency and Action
We present a Hilbert style axiomatization and an Equational theory for reasoning about actions and capabilities. We introduce two novel features in the language of Propositional Dynamic Logic (PDL), converse as backwards modality and abstract processes specified by preconditions and effects, written as φ⇒ ψ and first explored in our recent paper [8], where a Gentzen-style sequent calculus was i...
متن کامل